Test sequencing problems arising in test planning and design for testability

In this paper, we consider four test sequencing problems that frequently arise in Test Planning and Design For Testability (DFT) process. Specifically, we consider the following problems: 1) How to determine a test sequence that does not depend on the failure probability distribution? 2) How to determine a test sequence that minimizes expected testing cost while not exceeding a given testing time? 3) How to determine a test sequence that does not utilize more than a given number of tests, while minimizing the average ambiguity group size? 4) How to determine a test sequence that minimizes the storage cost of tests in the diagnostic strategy? We present various solution approaches to solve the above problems and illustrate the usefulness of the proposed algorithms.